منابع مشابه
FUNCTIONAL PEARLS Drawing Trees
This article describes the application of functional programming techniques to a problem previously studied by imperative programmers, that of drawing general trees automatically. We first consider the nature of the problem and the ideas behind its solution (due to Radack), independent of programming language implementation. We then describe a Standard ML program which reflects the structure of...
متن کاملConc-Trees for Functional and Parallel Programming Conc-Trees for Functional and Parallel Programming
Expressing parallel algorithms as functional programs has been a longstanding goal. This task is made easier through the use of proper sequence data structures, which allow splitting the data structure between the processors as easily as concatenating several data structures together. Efficient update, split and concatenation operations are essential for declarative-style parallel programs. Thi...
متن کاملAutomatic Functional Correctness Proofs for Functional Search Trees
In a new approach, functional correctness specifications of insert/update and delete operations on search trees are expressed on the level of lists by means of an inorder traversal function that projects trees to lists. With the help of a small lemma library, functional correctness and preservation of the search tree property are proved automatically (in Isabelle/HOL) for a range of data struct...
متن کاملFunctional Dependencies with Counting on Trees
The paper presents an axiomatisation for functional dependencies on trees that are defined using constructors for records, lists, sets and multisets. A simple form of restructuring permitting lists to be mapped onto multisets and multisets onto sets is added to the theory. Furthermore, the theory handles dependencies on sets treated as multisets. This adds the possibility to use the count of el...
متن کاملPurely Functional 1-2 Brother Trees
Enter the computing arboretum and you will find a variety of well-studied trees: AVL trees (Adel’son-Vel’skiı̆ & Landis, 1962), symmetric binary B-trees (Bayer, 1972), Hopcroft’s 2-3 trees (Aho et al., 1974), the bushy finger trees (Guibas et al., 1977), and the colourful red-black trees (Guibas & Sedgewick, 1978). In this pearl, we look at a more exotic species of balanced search trees, 1-2 bro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 2004
ISSN: 0885-6125
DOI: 10.1023/b:mach.0000027782.67192.13